Shao-Chin Sung und Dinko Dimitrov: Computational Complexity in Additive Hedonic Games
نویسندگان
چکیده
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. Furthermore, the corresponding decision problems with respect to the existence of a Nash stable coalition structure and of an individually stable coalition structure turn out to be NP-complete in the strong sense. JEL classification: C63; C70; C71; D02; D70; D71
منابع مشابه
Shao-chin Sung; Dinko Dimitrov: Computational Complexity in Additive Hedonic Games Computational Complexity in Additive Hedonic Games *
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. ...
متن کاملComputational complexity in additive hedonic games
The opinions expressed in this paper do not necessarily reflect the position of Summary We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration...
متن کاملOn core membership testing for hedonic coalition formation games
We are concerned with the problem of core membership testing for hedonic coalition formation games, which is to decide whether a certain coalition structure belongs to the core of a given game. We show that this problem is co-NP complete when playerspreferences are additive. JEL Classi cation : C71, C63.
متن کاملA Taxonomy of Myopic Stability Concepts for Hedonic Games
We present a taxonomy of myopic stability concepts for hedonic games in terms of deviations, and discuss the status of the existence problems of stable coalition structures. In particular, we show that contractual strictly core stable coalition structures always exist, and provide su¢ cient conditions for the existence of contractually Nash stable and weak individually stable coalition structur...
متن کاملSimple Priorities and Core Stability in Hedonic Games
In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies are considered. It turns out that the first domain restriction guarantees non-emptiness of the strong core...
متن کامل